/**
 * 
 */
package niuke;

import java.util.Scanner;

/**
 * 小易有一个长度为n的整数序列,a_1,...,a_n。然后考虑在一个空序列b上进行n次以下操作: 1、将a_i放入b序列的末尾 2、逆置b序列
 * 小易需要你计算输出操作n次之后的b序列。
 * 
 * @author zhongfang
 *
 */
public class 操作序列 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int[] A = new int[n];
		for (int i = 0; i < A.length; i++) {
			A[i] = scanner.nextInt();
		}
		int[] res = new int[n];
		int j = 0;
		int i = n - 1;
		for (; i >= 0; i -= 2) {
			res[j++] = A[i];
		}
		switch (i) {
		case -1:
			i = 0;
			break;
		case -2:
			i = 1;
			break;
		}
		for (; i < res.length; i += 2) {
			res[j++] = A[i];
		}
		StringBuilder sBuilder = new StringBuilder();
		for (int j1 = 0; j1 < res.length; j1++) {
			sBuilder.append(res[j1] + " ");
		}
		System.out.println(sBuilder.substring(0, sBuilder.length() - 1));
	}
}
